The Expressive Power of Two-Variable Least Fixed-Point Logics

نویسندگان

  • Martin Grohe
  • Stephan Kreutzer
  • Nicole Schweikardt
چکیده

The present paper gives a classification of the expressive power of two-variable least fixed-point logics. The main results are: 1. The two-variable fragment of monadic least fixed-point logic with parameters is as expressive as full monadic least fixed-point logic (on binary structures). 2. The two-variable fragment of monadic least fixed-point logic without parameters is as expressive as the two-variable fragment of binary least fixed-point logic without parameters. 3. The two-variable fragment of binary least fixed-point logic with parameters is strictly more expressive than the two-variable fragment of monadic least fixed-point logic with parameters (even on finite strings).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finite variable logics in descriptive complexity theory

Throughout the development of finite model theory, the fragments of first-order logic with only finitely many variables have played a central role. This survey gives an introduction to the theory of finite variable logics and reports on recent progress in the area. For each k 1 we let Lk be the fragment of first-order logic consisting of all formulas with at most k (free or bound) variables. Th...

متن کامل

Expressive power of monadic logics on words, trees, pictures, and graphs

We give a survey of the expressive power of various monadic logics on specific classes of finite labeled graphs, including words, trees, and pictures. Among the logics we consider, there are monadic secondorder logic and its existential fragment, the modal mu-calculus, and monadic least fixed-point logic. We focus on nesting-depth and quantifier alternation as a complexity measure of these logics.

متن کامل

Expressive Equivalence of Least and Inflationary Fixed-Point Logic

We study the relationship between least and inflationary fixed-point logic. By results of Gurevich and Shelah from 1986, it has been known that on finite structures both logics have the same expressive power. On infinite structures however, the question whether there is a formula in IFP not equivalent to any LFP-formula was still open. In this paper, we settle the question by showing that both ...

متن کامل

A logic with temporally accessible iteration

Deficiency in expressive power of the first-order logic has led to developing its numerous extensions by fixed point operators, such as Least Fixed-Point (LFP), inflationary fixed-point (IFP), partial fixed-point (PFP), etc. These logics have been extensively studied in finite model theory, database theory, descriptive complexity. In this paper we introduce unifying framework, the logic with it...

متن کامل

Bounded-Arity Hierarchies in Fixed-Point Logics

In this paper we prove that for each k, the expressive power of k–ary fixed–point logic, i.e. the fragment of fixed–point logic whose fixed–point operators are restricted to arity ≤ k, strictly exceeds the power of (k − 1)–ary fixed–point logic. This solves a problem that was posed by Chandra and Harel in 1982. Our proof has a rather general form that applies to several variants of fixed–point ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005